Gray codes over certain run-length sequences for local rank modulation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gray Images of Constacyclic Codes over some Polynomial Residue Rings

Let  be the quotient ring    where  is the finite field of size   and  is a positive integer. A Gray map  of length  over  is a special map from  to ( . The Gray map   is said to be a ( )-Gray map if the image of any -constacyclic code over    is a -constacyclic code over the field   . In this paper we investigate the existence of   ( )-Gray maps over . In this direction, we find an equivalent ...

متن کامل

On Rank Modulation Codes

We survey rank modulation codes based on a recent result by Mazumdar, Barg and Zemor [MBZ13]. The main results are explicit constructions of rank modulation codes that approach the bounds given by Barg and Mazumdar [BM10].

متن کامل

Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes

We investigate binary sequences which can be obtained by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of a surprisingly diverse ensemble of codes, namely the Levenshtein codes, capable of correcting insertion/deletion errors; spectral null codes, with spectral nulls at certain frequencies; as well as being ...

متن کامل

Local Rank Modulation for Flash Memories II

Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For 0 < s ≤ t ≤ n with s divides n, an (s, t, n)-LRM scheme is a local rank modulation scheme where the n cells are locally viewed cyclically through a sliding window of size t resulting in a sequence of small permutations which requires less comp...

متن کامل

New Capacity-Approaching Codes for Run-Length-Limited Channels

To my parents ACKNOWLEDGEMENTS I have cherished the opportunity to work with Dr. Steven W. McLaughlin. His constant encouragement and enthusiasm have made us all feel comfortable. I am very grateful for his guidance, and wish him and his family the very best in coming years. V. Kuznetsov for several helpful discussions and insights. Other not-so-insightful, but nevertheless entertaining discuss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2018

ISSN: 1674-733X,1869-1919

DOI: 10.1007/s11432-018-9509-y